Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(b(a(x1))))) → a(b(a(a(b(b(a(a(b(x1)))))))))

Q is empty.


QTRS
  ↳ QTRS Reverse

Q restricted rewrite system:
The TRS R consists of the following rules:

b(a(a(b(a(x1))))) → a(b(a(a(b(b(a(a(b(x1)))))))))

Q is empty.

We have reversed the following QTRS:
The set of rules R is

b(a(a(b(a(x1))))) → a(b(a(a(b(b(a(a(b(x1)))))))))

The set Q is empty.
We have obtained the following QTRS:

a(b(a(a(b(x))))) → b(a(a(b(b(a(a(b(a(x)))))))))

The set Q is empty.

↳ QTRS
  ↳ QTRS Reverse
QTRS
      ↳ RFCMatchBoundsTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a(b(a(a(b(x))))) → b(a(a(b(b(a(a(b(a(x)))))))))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:

a(b(a(a(b(x))))) → b(a(a(b(b(a(a(b(a(x)))))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

152, 153, 160, 161, 157, 158, 156, 154, 159, 155, 168, 169, 165, 166, 164, 162, 167, 163, 176, 177, 173, 174, 172, 170, 175, 171, 184, 185, 181, 182, 180, 178, 183, 179, 192, 193, 189, 190, 188, 186, 191, 187

Node 152 is start node and node 153 is final node.

Those nodes are connect through the following edges: